core frequent pattern mine commod pc gregori buehrer srinivasan parthasarathi amol ghote work focu problem frequent itemset mine larg core data set present character exist core frequent itemset mine algorithm drawback introduc effici highli scalabl solut present context fpgrowth algorithm techniqu involv consciou optim approxim hash base sort block leverag recent architectur advanc commod comput bit process evalu propos optim larg data set gb show yield greater fold execut time improv final discuss impact research context pattern mine challeng sequenc mine graph mine 